Revising the master production schedule in sequence dependent processes
نویسندگان
چکیده
Revising the master production schedule (MPS) in a rolling planning horizon environment to improve plant performance is critical in process industries with sequence dependent changeovers. Plant performance is defined in terms of process changeover time, total shortages, and finished goods inventory. Two heuristics for revising the MPS are introduced and tested against a rolling horizon MPS that does not take sequence dependent changeovers into consideration. These two heuristics represent two different approaches to heuristic design: local interchange (SWAP) and global interchange (3OPT). Simulation experiments are reported that test the performance of the two different approaches to revising the MPS in process industries with sequence dependent changeovers. The MPS designs were tested under plant conditions that are frequently encountered in process industries. The results indicate that revising the MPS in process industries significantly improves plant performance. In addition, 3OPT provides a major improvement in changeover time, while SWAP provides improvement in total shortages.
منابع مشابه
A Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کامل